An Extensional Kleene Realizability Semantics for the Minimalist Foundation

We build a Kleene realizability semantics for the two-level Minimalist Foundation MF, ideated by Maietti and Sambin in 2005 and completed by Maietti in 2009. Thanks to this semantics we prove that both levels of MF are consistent with the formal Church Thesis CT. Since MF consists of two levels, an intensional one, called mTT, and an extensional one, called emTT, linked by an interpretation, it is enough to build a realizability semantics for the intensional level mTT to get one for the extensional one emTT, too. Moreover, both levels consists of type theories based on versions of Martin-Löf’s type theory. Our realizability semantics formTT is a modification of the realizability semantics by Beeson in 1985 for extensional first order Martin-Löf’s type theory with one universe. So it is formalized in Feferman’s classical arithmetic theory of inductive definitions, called‘ ID1. It is called extensional Kleene realizability semantics since it validates extensional equality of type-theoretic functions extFun, as in Beeson’s one. The main modification we perform on Beeson’s semantics is to interpret propositions, which are defined primitively in MF, in a proof-irrelevant way. As a consequence, we gain the validity of CT. Recalling that extFun+ CT+ AC are inconsistent over arithmetics with finite types, we conclude that our semantics does not validate the Axiom of Choice AC on generic types. On the contrary, Beeson’s semantics does validate AC, being this a theorem of Martin-Löf’s theory, but it does not validate CT. The semantics we present here seems to be the best approximation of Kleene realizability for the extensional level emTT. Indeed Beeson’s semantics is not an option for emTT since AC on generic sets added to it entails the excluded middle. 1998 ACM Subject Classification F.4.1 Computability theory, Lambda calculus and related systems